The Good Pants Homology and a Proof of the Ehrenpreis Conjecture

نویسندگان

  • JEREMY KAHN
  • VLADIMIR MARKOVIC
چکیده

We develop the notion of the good pants homology and show that it agrees with the standard homology on closed surfaces (good pants are pairs of pants whose cuffs have the length nearly equal to some large number R > 0). Combined with our previous work on the Surface Subgroup Theorem [5], this yields a proof of the Ehrenpreis conjecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The good pants homology and the Ehrenpreis Conjecture

We develop the notion of the good pants homology and show that it agrees with the standard homology on closed surfaces (good pants are pairs of pants whose cuffs have the length nearly equal to some large number R > 0). Combined with our previous work on the Surface Subgroup Theorem [6], this yields a proof of the Ehrenpreis conjecture.

متن کامل

A short proof of the maximum conjecture in CR dimension one

In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...

متن کامل

The L 1 Ehrenpreis Conjecture

Let Σ be the algebraic universal cover of a closed surface of genus g > 1, T (Σ) its Teichmüller space, M(Σ,ℓ) the group of mapping classes stabilizing a fixed leaf ℓ. The L 1 Ehrenpreis conjecture asserts that M(Σ,ℓ) acts on T (Σ) with dense orbits in the L 1 topology (the topology coming from the L 1 norm on quadratic differentials). We give a proof of this weaker version of the Ehrenpreis co...

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011